منابع مشابه
Lazy Imperative Programming
In this paper we argue for the importance of lazy state, that is, sequences of imperative (destructive) actions in which the actions are delayed until their results are required. This enables state-based computations to take advantage of the control power of lazy evaluation. We provide some examples of its use, and describe an implementation within Glasgow Haskell.
متن کاملDatabase States in Lazy Functional Programming Languages: Imperative Update and Lazy Retrieval
This paper proposes a database manipulation interface for the statically typed, purely functional programming language Haskell. The data model uses surrogates to permit direct update of stored objects, and the basic interface is designed based on the state-transformer approach, so that the interface is referentially transparent. This approach requires all the operations to be executed in a sing...
متن کاملA behavioral theory of timing.
We base a theory of timing on the observation that signals of reinforcement elicit adjunctive behaviors. The transitions between these behaviors are well described as a Poisson process, with a rate constant proportional to the rate of reinforcement in the experimental context. These behaviors may come to serve as the basis for conditional discriminations of the passage of time. Varying the rate...
متن کاملLazy Approaches for Interval Timing Correlation of Sensor Data Streams
We propose novel algorithms for the timing correlation of streaming sensor data. The sensor data are assumed to have interval timestamps so that they can represent temporal uncertainties. The proposed algorithms can support efficient timing correlation for various timing predicates such as deadline, delay, and within. In addition to the classical techniques, lazy evaluation and result cache are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.282.1